Backward induction with players who doubt others' faultlessness

نویسندگان

  • Aviad Heifetz
  • Ady Pauzner
چکیده

We investigate the robustness of the backward-induction outcome, in binaryaction extensive-form games, to the introduction of small mistakes in reasoning. Specifically, when a player contemplates the best action at a future decision node, she assigns some small probability to the event that other players may reach a different conclusion when they carry out the same analysis. We show that, in a long centipede game, the prediction that players do not cooperate fails under this perturbation. Importantly, this result does not depend on forward induction or reputation reasoning. It particular, it applies to finite horizon overlapping generations models with fiat money. J.E.L Classification No. C73, Field: Game Theory ∗We thank the associate editor and two anonymous referees for very helpful comments. We also benefited from discussions with Eddie Dekel, Herakles Polemarchakis, and Asher Wolinsky. †The Economics and Management Department, The Open University of Israel, [email protected] ‡Eitan Berglass School of Economics, Tel Aviv University, [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Dynamic Level-k Model in Centipede Games

Backward induction is the most widely accepted principle for predicting behavior in dynamic games. In experiments, however, players frequently violate this principle. An alternative is a 2-parameter “dynamic level-k” model, where players choose a rule from a rule hierarchy. The rule hierarchy is iteratively defined such that the level-k rule is a best-response to the level-(k − 1) rule and the ...

متن کامل

A Dynamic Level-k Model in Sequential Games

Backward induction is a widely accepted principle for predicting behavior in sequential games. In the classic example of the “centipede game,” however, players frequently violate this principle. An alternative is a “dynamic level-k” model, where players choose a rule from a rule hierarchy. The rule hierarchy is iteratively defined such that the level-k rule is a best response to the level-(k-1)...

متن کامل

A Dynamic Level-k Model in Sequential Games

Backward induction is a widely accepted principle for predicting behavior in sequential games. In the classic example of the so-called “centipede game”, however, players frequently violate this principle. An alternative is a “dynamic level-k” model, where players choose a rule from a rule hierarchy. The rule hierarchy is iteratively defined such that the level-k rule is a best-response to the l...

متن کامل

A Dynamic Level-k Model in Games

Backward induction is the most widely accepted principle for predicting behavior in dynamic games. In experiments, however, players frequently violate this principle. An alternative is a 2-parameter “dynamic level-k” model, where players choose a rule from a rule hierarchy. The rule hierarchy is iteratively defined such that the level-k rule is a best-response to the level-(k− 1) rule and the l...

متن کامل

A Note on Backward Inductionl

In 1987, I wrote a paper (Binmore [14]) that questioned the rationality of the backward induction principle in finite games of perfect information. Since that time, a small literature has grown up in which Antonelli and Bicchieri [1], BenPorath [9], Bicchieri [10,11], Bonanno [21,22], Pettit and Sugden [28], Reny [30], Samet [32], Stalnaker [37,36] and numerous others have attempted with varyin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Mathematical Social Sciences

دوره 50  شماره 

صفحات  -

تاریخ انتشار 2005